Adaptive Random Testing with Combinatorial Input Domain

نویسندگان

  • Rubing Huang
  • Jinfu Chen
  • Yansheng Lu
چکیده

Random testing (RT) is a fundamental testing technique to assess software reliability, by simply selecting test cases in a random manner from the whole input domain. As an enhancement of RT, adaptive random testing (ART) has better failure-detection capability and has been widely applied in different scenarios, such as numerical programs, some object-oriented programs, and mobile applications. However, not much work has been done on the effectiveness of ART for the programs with combinatorial input domain (i.e., the set of categorical data). To extend the ideas to the testing for combinatorial input domain, we have adopted different similarity measures that are widely used for categorical data in data mining and have proposed two similarity measures based on interaction coverage. Then, we propose a new version named ART-CID as an extension of ART in combinatorial input domain, which selects an element from categorical data as the next test case such that it has the lowest similarity against already generated test cases. Experimental results show that ART-CID generally performs better than RT, with respect to different evaluation metrics.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Adaptive Random Testing Through Dynamic Partitioning By Localization with Distance and Enlarged Input Domain

1 Abstract—Based on the intuition that evenly distributed test cases have more chance for revealing non-point pattern failure regions, various Adaptive Random Testing (ART) methods have been proposed. A large portion of this methods such as ART with random partitioning by localization have edge preference problem. This problem would decrease the performance of these methods. In this article the...

متن کامل

On the Effectiveness of Genetic Operators in Adaptive Random Testing

Adaptive random testing (ART) has recently been found to be an effective way to improve the performance of random testing by selecting widespread test cases from the input domain. In this paper, we outline how the selection, mutation and crossover operators of the genetic algorithm (GA) can be used in ART, and investigate experimentally which of these is the most appropriate operation to serve ...

متن کامل

On Adaptive Random Testing Through Iterative Partitioning

Random Testing (RT) is an important and fundamental approach to testing computer software. Adaptive Random Testing (ART) has been proposed to improve the faultdetection capability of RT. ART employs the location information of successful test cases (those that have been executed but not revealed a failure) to enforce an even spread of random test cases across the input domain. Distance-based AR...

متن کامل

Distributing test cases more evenly in adaptive random testing

Adaptive Random Testing (ART) has recently been proposed to enhance the failure-detection capability of Random Testing. In ART, test cases are not only randomly generated, but also evenly spread over the input domain. Various ART algorithms have been developed to evenly spread test cases in different ways. Previous studies have shown that some ART algorithms prefer to select test cases from the...

متن کامل

On Test Case Distributions of Adaptive Random Testing

Adaptive Random Resting (ART) has recently been proposed as an approach to enhancing the fault-detection effectiveness of Random Testing (RT). The basic principle of ART is to enforce randomly selected test cases as evenly spread over the input domain as possible. Many ART methods have been proposed to evenly spread test cases in different ways, but no comparison has been made among these metho...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره 2014  شماره 

صفحات  -

تاریخ انتشار 2014